Quantum Complexity of Graph and Algebraic Problems
نویسنده
چکیده
Acknowledgments First of all, I would like to thank my supervisor Jacobo Torán for his support and guidance during my research on this work. I am grateful to Thomas Thierauf for refereeing my thesis. His invaluable discussions and suggestions have been reflected in many places in this research. Thanks to Jens Bolte for reading the whole thesis and refereeing it. My thanks go also to Martin Bader, Sebastian Speiser and Dieter Lippoldt for their careful readings and the helpful comments to improve this script. Furthermore I would like to thank my parents and grandparents for their support and encouragement.
منابع مشابه
Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members
Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...
متن کاملThe Banach Type Contraction for Mappings on Algebraic Cone Metric Spaces Associated with An Algebraic Distance and Endowed with a Graph
In this work, we define the notion of an algebraic distance in algebraic cone metric spaces defined by Niknam et al. [A. Niknam, S. Shamsi Gamchi and M. Janfada, Some results on TVS-cone normed spaces and algebraic cone metric spaces, Iranian J. Math. Sci. Infor. 9 (1) (2014), 71--80] and introduce some its elementary properties. Then we prove the existence and uniqueness of fixed point for a B...
متن کاملOptimizing Teleportation Cost in Multi-Partition Distributed Quantum Circuits
There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems....
متن کاملOn efficiently solvable cases of Quantum k-SAT
The constraint satisfaction problems k-SAT and Quantum k-SAT (k-QSAT) are canonical NP-complete and QMA1-complete problems (for k ≥ 3), respectively, where QMA1 is a quantum generalization of NP with one-sided error. Whereas k-SAT has been well-studied for special tractable cases, as well as from a parameterized complexity perspective, much less is known in similar settings for k-QSAT. Here, we...
متن کاملOn the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملQuantum Complexity Bounds for Independent Set Problems
We present quantum complexity lower and upper bounds for independent set problems in graphs. In particular, we give quantum algorithms for computing a maximal and a maximum independent set in a graph. We present applications of these algorithms for some graph problems. Our results improve the best classical complexity bounds for the corresponding problems.
متن کامل